Computation of Fisher-Gale equilibrium by auction

نویسندگان

  • Yu. Nesterov
  • V. Shikhman
چکیده

Abstract We study the Fisher model of a competitive market from the algorithmic perspective. For that, the related convex optimization problem due to Gale and Eisenberg [10] is used. The latter problem is known to yield a Fisher equilibrium under some structural assumptions on consumers’ utilities, e.g. homogeneity of degree 1, homotheticity etc. Our goal is to examine the applicability of the convex optimization framework by departing from these traditional assumptions. We just assume the concavity of consumers’ utility functions. For this case we suggest a novel concept of Fisher-Gale equilibrium by using consumers’ utility prices. The prices of utility transfer the utility of a consumption bundle to a common numéraire. We develop a subgradient-type algorithm from Convex Analysis to compute a Fisher-Gale equilibrium via Gale’s approach. In order to decentralize prices, we additionally implement the auction design, i.e. consumers settle and update their individual prices and producers sell at the highest offer price. Our price adjustment is based on a tâtonnement procedure, i.e. the prices change proportionally to consumers’ individual excess supplies. Historical averages of consumption are shown to clear the market of goods. Our algorithm enjoys a convergence rate. In worst case, the number of price updates needed to achieve the ε-tolerance is proportional to 1 ε2 .

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lottery versus all - pay auction models of lobbying ∗

I first provide a complete characterization of the unique equilibrium of the lottery game by n lobbyists with asymmetric valuations, and then compare the lottery and the all-pay auction models of lobbying. I show that the exclusion principle discovered by Baye, Kovenock and de Vries (1993) for all-pay auction does not apply to lottery. I also show that the perverse effect that an exogenous cap ...

متن کامل

Computing Equilibria in a Fisher Market with Linear Single-Constraint Production Units

We study the problem of computing equilibrium prices in a Fisher market with linear utilities and linear single-constraint production units. This setting naturally appears in ad pricing where the sum of the lengths of the displayed ads is constrained not to exceed the available ad space. There are three approaches to solve market equilibrium problems: convex programming, auction-based algorithm...

متن کامل

Ascending Unit Demand Auctions with Budget Limits

We show that the the unit demand auction introduced by Demange, Gale and Sotomayor [5] is incentive compatible even when bidders have budget constraints. Furthermore we show that myopic bidding is an ex post equilibrium. Finally, we show that any other incentive compatible which always outputs a competitive equilibrium (envy free) must coincide with the DGS auction.

متن کامل

Position Auctions

I analyze the equilibria of a game based on the ad auction used by Google and Yahoo. This auction is closely related to the assignment game studied by Shapley–Shubik, Demange–Gale–Sotomayer and Roth– Sotomayer. However, due to the special structure of preferences, the equilibria of the ad auction can be calculated explicitly and some known results can be sharpened. I provide some empirical evid...

متن کامل

Difference-Form Contests and the Robustness of All-Pay Auctions

In much of the existing literature on rent-seeking games, the outcome of the contest is either infinitely sensitive or relatively insensitive to contestants’ efforts. The current paper presents a family of contest games that permit characterization of equilibrium for all levels of sensitivity of the outcome to contestants’ efforts. Specifically, the outcome of the contest depends on the differe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015